MSO zero-one laws on random labelled acyclic graphs
نویسنده
چکیده
We use Ehrenfeucht-type games to prove that Monadic Second Order logic admits labelled zero-one laws for random free trees, generating the complete almost sure theory. Our method will be to dissect random trees to get a picture of what almost all random free trees look like. We will use elementary (second moment) methods to obtain probability results. Abstract Key words: random labelled trees, monadic second order zero-one laws, second order fraisse-ehrenfeucht games, second moment method PACS:
منابع مشابه
Logical properties of random graphs from small addable classes
We establish zero-one laws and convergence laws for monadic secondorder logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes. In particular, we show that MSO obeys a zero-one law on the class of connected planar graphs, the class of connected graphs of tree-width at most k and the class of connected graphs excluding the k-clique as a minor. In each of these ...
متن کاملMonadic Second Order Asymptotics on Random Acyclic Graphs
We classify the vertices of trees, and use a primitive Poisson approximation argument to prove that almost all trees have almost the same proportion of vertices of each kind. We use a graph surgery construction to investigate the asymptotic probabilities of order-invariant Monadic Second Order (with built-in linear ordering) queries over random free trees, proving that for any MSO query , the p...
متن کاملLogical limit laws for minor-closed classes of graphs
Let G be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all connected graphs in G on n vertices, and the convergence law in MSO holds if we draw uniformly at random from all graphs in G on n vertices. We also prove analogues of these results for the class of graphs embeddable ...
متن کاملAsymptotic Enumeration and Limit Laws of Planar Graphs
A graph is planar if it can be embedded in the plane, or in the sphere, so that no two edges cross at an interior point. A planar graph together with a particular embedding is called a map. There is a rich theory of counting maps, started by Tutte in the 1960’s. However, in this paper we are interested in counting graphs as combinatorial objects, regardless of how many nonequivalent topological...
متن کاملIntersecting random graphs and networks with multiple adjacency constraints: A simple example
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations. A simple idea to account for multiple constraints consists in taking the intersection of random graphs. In this paper we initiate the study of random graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 254 شماره
صفحات -
تاریخ انتشار 2002